EMBEDDINGS INTO THE PANCAKE INTERCONNECTION NETWORK

Embeddings into the Pancake Interconnection Network

Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In this paper, we present embeddings of rings, grids and hypercubes into the pancake with constant dilation and congestion. We also extend the results to similar efficient embeddings into the star graph.

[hal-00465652, v1] Embeddings into the Pancake Interconnection Network

Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In this paper, we present embeddings of rings, grids and hypercubes into the pancake with constant dilation and congestion. We also extend the results to similar efficient embeddings into the star graph.

Cycle embedding in pancake interconnection networks

The ring structure is important for distributed computing, and it is useful to construct a hamiltonian cycle or rings of various length in the network. Kanevsky and Feng [3] proved that all cycles of length l where 6 ≤ l ≤ n!−2 or l = n! can be embedded in the pancake graphs Gn. Later, Senoussi and Lavault [9] presented the embedding of ring of length l, 3 ≤ l ≤ n!, with dilation 2 in the panca...

Multiple Network Embeddings into Hypercubes

In this paper we study the problem of how to efficiently embed r interconnection networks Go, ... ,Gr _ ll r :$ k, into a k-dimensional hypercube H so that every node of the hypercube is assigned at most T nodes all of which belong to different G;'s. When each G j is a complete binary tree or a leap tree of 2 -1 nodes, we describe an embedding achieving a dilation of 2 and a load of 5 and 6, re...

Fault Tolerant Routing in the Star and Pancake Interconnection Networks